Ambient Calculus and its Logic in the Calculus of Inductive Constructions
نویسندگان
چکیده
منابع مشابه
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of the theory and metatheory of Ambient Calculus and its modal logic in the Calculus of Inductive Constructions. We take full advantage of Higher-Order Abstract Syntax, using the Theory of Contexts as a fundamental tool fo...
متن کاملInductive Consequences in the Calculus of Constructions
Extending the calculus of constructions with rewriting would greatly improve the efficiency of proof assistants such as Coq. In this paper we address the issue of the logical power of such an extension. In our previous work we proposed a procedure to check completeness of user-defined rewrite systems. In many cases this procedure demonstrates that only a basic subset of the rules is sufficient ...
متن کاملMembership Equational Logic, Calculus of Inductive Constructions, and Rewrite Logic 1 Extended Abstract
This paper is part of a long-term eeort to increase expressiveness of speciication languages while at the same time having a Curry-Howard semantic basis on which three major tools can be based, namely eecient execution by rewriting, powerful interactive and automated theorem-proving environments, and extraction of provably correct code from speciications. This eeort is conducted within the rese...
متن کاملOn the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the formalization of modal (sequent-style) rules and of context sensitive grammars. The formalization c...
متن کاملFormalization of SLD-Resolution in the calculus of inductive constructions
This report presents a full formalization of the operational semantics of deenite programs (used in logic programming), given by SLD-Resolution. The variables renaming process used during a SLD-derivation is completely deened in an explicit manner. Furthermore, constructive proofs of two well known lemmas (lifting lemma and switching lemma) are built from this formalization in the calculus of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80507-3